Chaotic Multi-Objective Simulated Annealing and Threshold Accepting for Job Shop Scheduling Problem

The Job Shop Scheduling Problem (JSSP) has enormous industrial applicability. This problem refers to a set of jobs that should be processed in specific order using machines. For the single-objective optimization JSSP problem, Simulated Annealing is among best algorithms. However, Multi-Objective (MOJSSP), these algorithms have barely been analyzed, and Threshold Accepting Algorithm not published for this problem. It worth mentioning researchers area reported studies with more than three objectives, number metrics they used measure their performance less two or three. In paper, we present MOJSSP metaheuristics based on Annealing: Chaotic (CMOSA) (CMOTA). We developed minimize objective functions compared them HV metric recently algorithms, MOMARLA, MOPSO, CMOEA, SPEA. algorithm CMOSA (HV 0.76), followed by MOMARLA CMOTA (with 0.68), MOPSO 0.54). addition, show complexity comparison showing CMOSA, CMOTA, similar class, MOPSO.